Public Key Exchange Using Matrices Over Group Rings
نویسندگان
چکیده
We offer a public key exchange protocol in the spirit of Diffie-Hellman, but weuse (small) matrices over a group ring of a (small) symmetric group as the platform. This“nested structure” of the platform makes computation very efficient for legitimate parties.We discuss security of this scheme by addressing the Decision Diffie-Hellman (DDH) andComputational Diffie-Hellman (CDH) problems for our platform.
منابع مشابه
A Diffie-Hellman Key Exchange Using Matrices Over Non Commutative Rings
We consider a key exchange procedure whose security is based on the difficulty of computing discrete logarithms in a group, and where exponentiation is hidden by a conjugation. We give a platform-dependent cryptanalysis of this protocol. Finally, to take full advantage of this procedure, we propose a group of matrices over a noncommutative ring as platform group.
متن کاملHomomorphic public-key cryptosystems over groups and rings
We propose a new homomorphic public-key cryptosystem over arbitrary nonidentity nite group based on the di culty of the membership problem for groups of integer matrices. Besides, a homomorphic cryptosystem is designed for the rst time over nite commutative rings.
متن کاملCryptanalysis of Some Protocols Using Matrices over Group Rings
It is important to search for easily implementable groups, for which the DL problem is hard and there is no known subexponential time algorithm for computing DL. The group of points over Fq of an elliptic curve is such a group. In [8], the group of invertible matrices with coefficients in a finite field was considered for such a key exchange. In [6], using the Jordan form it was shown that the ...
متن کاملPublic key cryptosystem and a key exchange protocol using tools of non-abelian group
Abstract. Public Key Cryptosystems assure privacy as well as integrity of the transactions between two parties. The sizes of the keys play an important role. The larger the key the harder is to crack a block of encrypted data. We propose a new public key cryptosystem and a Key Exchange Protocol based on the generalization of discrete logarithm problem using Non-abelian group of block upper tria...
متن کاملPublic key exchange using extensions by endomorphisms and matrices over a Galois field
In this paper, we describe a public key exchange protocol based on an extension of a semigroup by automorphisms (more generally, by endomorphisms). One of its special cases is the standard DiffieHellman protocol, which is based on a cyclic group. However, when our protocol is used with a non-commutative (semi)group, it acquires several useful features that make it compare favorably to the Diffi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Groups Complexity Cryptology
دوره 5 شماره
صفحات -
تاریخ انتشار 2013